منابع مشابه
Pseudorandomness from Braid Groups
Recently the braid groups were introduced as a new source for cryptography. The group operations are performed efficiently and the features are quite different from those of other cryptographically popular groups. As the first step to put the braid groups into the area of pseudorandomness, this article presents some cryptographic primitives under two related assumptions in braid groups. First, ...
متن کاملLecture 22 : Pseudorandomness from Hardness
At the early lectures of this class, it was briefly mentioned that if there exist Pseudorandom Generators for this class, then there exists Pseudorandom Generators for all randomized procedures which run in polynomial time. Because any BPP can be simulated by a Boolean circuit, then there exists Pseudorandom Generators for BBP family. In this class the focus will be in completeness, but the dra...
متن کاملPseudorandomness
We postulate that a distribution is pseudorandom if it cannot be told apart from the uniform distribution by any eecient procedure. This yields a robust deenition of pseudorandom generators as eecient deterministic programs stretching short random seeds into longer pseudorandom sequences. Thus, pseudorandom generators can be used to reduce the randomness-complexity in any eecient procedure. Pse...
متن کاملDimension, Pseudorandomness and Extraction of Pseudorandomness
In this paper we propose a quantification of ensemble of distributions on a set of strings, in terms of how close to pseudorandom a distribution is. The quantification is an adaptation of the theory of dimension of sets of infinite sequences introduced by Lutz. Adapting Hitchcock’s work, we also show that the logarithmic loss incurred by a predictor on an ensemble of distributions is quantitati...
متن کاملOn Obtaining Pseudorandomness from Error-Correcting Codes
Constructing pseudorandom objects based on codes has been the focus of some recent research. These constructions were based on specific algebraic codes and were rather simple in their structure in that a random index into a codeword was picked and m subsequent symbols output. In this work, we explore the question of whether it is possible to extend the scope of application of this paradigm of c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2019
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3230630